Isoperimetric Inequalities in Conically Bounded Convex Bodies

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A sharp isoperimetric bound for convex bodies

We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp for all set sizes, dimensions, and norms. In the case of uniform density a stronger theorem is shown which is also sharp.

متن کامل

Schur-convex Functions and Isoperimetric Inequalities

In this paper, we establish some analytic inequalities for Schurconvex functions that are made of solutions of a second order nonlinear differential equation. We apply these analytic inequalities to obtain some geometric inequalities.

متن کامل

On Isoperimetric Inequalities for Log-convex Measures

Let μ = ρdx be a Borel measure on Rd. A Borel set A ⊂ R is a solution of the isoperimetric problem if for any B ⊂ R satisfying μ(A) = μ(B) one has μ(∂A) ≤ μ(∂B), where μ(∂A) = ∫ ∂A ρ dHd−1 is the corresponding surface measure. There exists only a small number of examples where the isoperimetric problem has an exact solution. The most important case is given by Lebesgue measure λ on R, the solut...

متن کامل

Some Isoperimetric Comparison Theorems for Convex Bodies in Riemannian Manifolds

We prove that the isoperimetric profile of a convex domain Ω with compact closure in a Riemannian manifold (M, g) satisfies a second order differential inequality which only depends on the dimension of the manifold and on a lower bound on the Ricci curvature of Ω. Regularity properties of the profile and topological consequences on isoperimetric regions arise naturally from this differential po...

متن کامل

On Conically Ordered Convex Programs

In this paper we study a special class of convex optimization problems called conically ordered convex programs (COCP), where the feasible region is given as the level set of a vector-valued nonlinear mapping, expressed as a nonnegative combination of convex functions. The nonnegativity of the vectors is defined using a pre-described conic ordering. The new model extends the ordinary convex pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Geometric Analysis

سال: 2015

ISSN: 1050-6926,1559-002X

DOI: 10.1007/s12220-015-9559-9